Solution to DC Optimal Power Flow Problems with Demand Response via Distributed Asynchronous Primal-Dual Algorithms
نویسندگان
چکیده
منابع مشابه
Algorithms for distributed solution of the Optimal Power Flow problem
Modern power networks often have partitioned structures, with disjoint parts of the network being operated by competing agents. It is therefore of significant interest to be able to solve the Optimal Power Flow (OPF) problem for the entire network in a distributed manner without requiring significant exchange of sensitive operational information between rival operators. For networks whose regio...
متن کاملDC Optimal Power Flow Formulation and Solution Using QuadProgJ∗
Nonlinear AC Optimal Power Flow (OPF) problems are commonly approximated by linearized DC OPF problems to obtain real power solutions for restructured wholesale power markets. We first present a standard DC OPF problem, which has the numerically desirable form of a strictly convex quadratic programming (SCQP) problem when voltage angles are eliminated by substitution. We next augment this stand...
متن کاملPrimal - Dual Algorithms for Combinatorial Optimization Problems
Title of dissertation: PRIMAL-DUAL ALGORITHMS FOR COMBINATORIAL OPTIMIZATION PROBLEMS Julián Mestre Doctor of Philosophy, 2007 Dissertation directed by: Professor Samir Khuller Department of Computer Science Combinatorial optimization problems such as routing, scheduling, covering and packing problems abound in everyday life. At a very high level, a combinatorial optimization problem amounts to...
متن کاملDistributed Approach for DC Optimal Power Flow Calculations
The trend in the electric power system is to move towards increased amounts of distributed resources which suggests a transition from the current highly centralized to a more distributed control structure. In this paper, we propose a method which enables a fully distributed solution of the DC Optimal Power Flow problem (DC-OPF), i.e. the generation settings which minimize cost while supplying t...
متن کاملGroup Strategyproof Mechanisms via Primal-Dual Algorithms
We develop a general method for cost-sharing that is approximately budget balanced and group strategyproof. We use our method to design cost sharing mechanisms for two NP-complete problems: metric facility location, and single source rent-or-buy network design. Both mechanisms are competitive, group strategyproof and recover a constant fraction of the cost. For the facility location game our co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SICE Journal of Control, Measurement, and System Integration
سال: 2020
ISSN: 1882-4889,1884-9970
DOI: 10.9746/jcmsi.13.66